Uncertain Attribute Graph Sub-Graph Isomorphism and its Determination Algorithm

The expectative sub-graph isomorphism of uncertain attribute graph is based on the analysis of complex network structure and the characteristic of uncertain attribute graph. The expectative sub-graph isomorphism of uncertain attribute graph is only one threshold value as constraint conditions. The method is simple, but the computation is large amount. Therefore, this paper brings in the definition of   subgraph isomorphism of uncertain attribute graph, and explains the concept. Then, this paper designs and comes true the algorithm of   sub-graph isomorphism. Finally, through the experiments proves that    sub-graph isomorphic is better than expectative sub-graph, and it analyzes the variation in the different threshold cases. The research of   sub-graph isomorphism algorithm laid the foundation for uncertain attribute graph sub-graph query and community mining.